On Cullen numbers which are both Riesel and Sierpiński numbers
نویسندگان
چکیده
منابع مشابه
Nonlinear Sierpiński and Riesel numbers
Article history: Received 19 September 2011 Revised 10 June 2012 Accepted 30 August 2012 Available online xxxx Communicated by Michael A. Bennett MSC: 11B83 11Y05
متن کاملOn Generalized Cullen and Woodall Numbers That are Also Fibonacci Numbers
The m-th Cullen number Cm is a number of the form m2 m + 1 and the m-th Woodall number Wm has the form m2 m − 1. In 2003, Luca and Stănică proved that the largest Fibonacci number in the Cullen sequence is F4 = 3 and that F1 = F2 = 1 are the largest Fibonacci numbers in the Woodall sequence. A generalization of these sequences is defined by Cm,s = ms m+1 and Wm,s = ms m−1, for s > 1. In this pa...
متن کاملOn Fibonacci numbers which are elliptic Korselt numbers
Here, we show that if E is a CM elliptic curve with CM field Q( √ −d), then the set of n for which the nth Fibonacci number Fn satisfies an elliptic Korselt criterion for Q( √ −d) (defined in the paper) is of asymptotic density zero.
متن کاملVerifying Sierpinski and Riesel Numbers in ACL2
Sierpiński and Riesel numbers are not easy to find. To disqualify an odd positive integer as a Sierpiński number or a Riesel number, one need only locate a prime in the appropriate infinite list. With four exceptions, k = 47,103,143,197, all of the first 100 odd positive integers, 1 ≤ k ≤ 199, are disqualified as Sierpiński numbers by finding at least one prime in the first eight elements of th...
متن کاملLucas-sierpiński and Lucas-riesel Numbers
In this paper, we show that there are infinitely many Sierpiński numbers in the sequence of Lucas numbers. We also show that there are infinitely many Riesel numbers in the sequence of Lucas numbers. Finally, we show that there are infinitely many Lucas numbers that are not a sum of two prime powers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2012
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2012.05.021